A nonmonotone spectral projected gradient method for large-scale topology optimization problems
نویسندگان
چکیده
منابع مشابه
A Nonmonotone Spectral Projected Gradient Method for Large-scale Topology Optimization Problems
An efficient gradient-based method to solve the volume constrained topology optimization problems is presented. Each iterate of this algorithm is obtained by the projection of a Barzilai-Borwein step onto the feasible set consisting of box and one linear constraints (volume constraint). To ensure the global convergence, an adaptive nonmonotone line search is performed along the direction that i...
متن کاملSpectral projected gradient method for stochastic optimization
We consider the Spectral Projected Gradient method for solving constrained optimization porblems with the objective function in the form of mathematical expectation. It is assumed that the feasible set is convex, closed and easy to project on. The objective function is approximated by a sequence of Sample Average Approximation functions with different sample sizes. The sample size update is bas...
متن کاملGradient Method with Dynamical Retards for Large-scale Optimization Problems
We consider a generalization of the gradient method with retards for the solution of large-scale unconstrained optimization problems. Recently, the gradient method with retards was introduced to find global minimizers of large-scale quadratic functions. The most interesting feature of this method is that it does not involve a decrease in the objective function, which allows fast local convergen...
متن کاملNonmonotone Spectral Projected Gradient Methods on Convex Sets
Nonmonotone projected gradient techniques are considered for the minimization of differentiable functions on closed convex sets. The classical projected gradient schemes are extended to include a nonmonotone steplength strategy that is based on the Grippo-Lampariello-Lucidi nonmonotone line search. In particular, the nonmonotone strategy is combined with the spectral gradient choice of stepleng...
متن کاملA Nonmonotone Projected Gradient Method for Optimization over Sparse Symmetric Sets
We consider the problem of minimizing a Lipschitz differentiable function over a class of sparse symmetric sets that has wide applications in engineering and science. For this problem, it is known that any accumulation point of the classical projected gradient (PG) method with a constant stepsize 1/L satisfies the L-stationarity optimality condition that was introduced in [3]. In this paper we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algebra, Control and Optimization
سال: 2012
ISSN: 2155-3289
DOI: 10.3934/naco.2012.2.395